An Efficient Reasoner for Description Logics of Typicality and Rational Closure

نویسندگان

  • Laura Giordano
  • Valentina Gliozzi
  • Gian Luca Pozzato
  • Riccardo Renzulli
چکیده

In this work we present RAT-OWL, a Protégé 4.3 Plugin for reasoning about typicality in preferential Description Logics. RAT-OWL allows the user to reason in a nonmonotonic extension of Description Logics based on the notion of “rational closure”. This logic extends standard Description Logics in order to express “typical” properties, that can be directly specified by means of a typicality operator T: T(C) v D represents that “typical Cs are also Ds”. We show experimental results, indicating that the performances of RAT-OWL are promising.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RAT-OWL: Reasoning with Rational Closure in Description Logics of Typicality

We present RAT-OWL, a software system for reasoning about typicality in preferential Description Logics. It is implemented in the form of a Protégé 4.3 Plugin and it allows the user to reason in a nonmonotonic extension of Description Logics based on the notion of “rational closure”. This logic extends standard Description Logics in order to express “typical” properties, that can be directly sp...

متن کامل

Minimal Model Semantics and Rational Closure in Description Logics

We define the notion of rational closure in the context of Description Logics. We start from an extension of ALC with a typicality operator T allowing to express concepts of the form T(C), whose meaning is to select the “most normal” instances of a concept C. The semantics we consider is based on rational models and exploits a minimal models mechanism based on the minimization of the rank of do...

متن کامل

Making Quantification Relevant Again

Defeasible Description Logics (DDLs) extend Description Logics with defeasible concept inclusions. Reasoning in DDLs often employs rational or relevant closure according to the (propositional) KLM postulates. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, this relationship might also hold if these concepts appear in existential restrictions. Such ne...

متن کامل

On Rational Closure in Description Logics of Typicality

We define the notion of rational closure in the context of Description Logics extended with a tipicality operator. We start from ALC +T, an extension of ALC with a typicality operator T : intuitively allowing to express concepts of the form T(C), meant to select the “most normal” instances of a concept C. The semantics we consider is based on rational model. But we further restrict the semantic...

متن کامل

Making Quantification Relevant Again - the Case of Defeasible EL_\bot

Defeasible Description Logics (DDLs) extend Description Logics with defeasible concept inclusions. Reasoning in DDLs often employs rational or relevant closure according to the (propositional) KLM postulates. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, this relationship might also hold if these concepts appear in existential restrictions. Such ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017